Communication Network System Of Bus Network Structure And Message Routing Method Using The System

ABSTRACT

Disclosed is a method for processing a message routing in a communication network system having a bus network structure, wherein: the communication network system includes a broker processing a message routing, a connector, and a plurality of services which is a communicable terminal node connected to the broker via the connector, and the method includes the steps of: connecting all brokers of the communication network system to each other in a full mesh topology, each broker maintaining a predetermined routing table; connecting the connector to the broker and setting up a connection between the service and the broker via the connector; allocating a network address to the each connected service, and maintaining the network address and a socket ID of a broker connected to the each service in the routing table; and processing a message routing between the each service by using the network address and the socket ID maintained in the routing table.

TECHNICAL FIELD

The present invention relates to a communication network system in a bus network structure and a method for processing a message routing in the communication network system. More particularly, the present invention relates to a communication network system which can allocate a network address to each service, maintain the network address and a socket ID of a broker connected to each service in a routing table of the broker, and process a message routing between each service by using the network address and the socket ID maintained in the routing table, in a communication network system having a bus network structure in which at least one service contained in one process is connected to a broker processing a message routing via one connector and all brokers of a network are connected to each other in a full mesh topology.

BACKGROUND ART

In the conventional art, all game servers providing game service are connected to each other in a mesh topology. FIG. 1 is a diagram illustrating network connections between game servers according to the conventional art.

According to the conventional art illustrated in FIG. 1, every time new game servers are added, there is a surprising increase in a number of connections from the viewpoint of the entire network. FIG. 2 is a diagram illustrating network connections between game servers which may occur as a number of game servers continuously increases in the conventional art.

According to the conventional art in which game servers are connected to each other with mesh topology, as described above, when a number of game servers increases, the connection structure thereof also becomes very complicated. As a result, a game server may not be able to be extended according to an increase of game users. Also, when a connection between game servers is globally extended, the management thereof also becomes difficult.

The more a number of partner servers connect to one server, the more the total number of connections geometrically increases. Generally, in the conventional art, one game server is connected to a login server, a ranking server, and a database server. In this instance, the game server is additionally grouped with a channel list server and a notice server as one multicast group. Accordingly, a substantial number of connections in the entire network greatly exceeds a number of connections between game servers. Also, its management is very difficult.

Consequently, a new communication network structure which can deviate from a network structure according to the conventional art connecting all game servers in a mesh topology, simplify and easily manage a connection structure between servers, and efficiently extend services is needed. Also, a method capable of efficiently processing a message routing in the new communication network structure is needed.

DISCLOSURE OF INVENTION Technical Goals

The present invention is conceived to solve the aforementioned problems in the conventional art. Thus, an objective of the present invention is to provide a method for efficiently processing a message routing via a routing table maintained by a broker, in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Another objective of the present invention is to include a network address of each service in a routing table maintained by each broker, in correspondence to a socket ID of a broker connected to the each service, and enable a broker to efficiently perform a message routing via a routing table in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Still another objective of the present invention is to automatically inform other brokers when a routing table maintained by a particular broker is changed, and to enable the other brokers to update their routing table in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Yet another objective of the present invention is to embody natural load balancing by moving a proper number of connectors connected to an existing broker to an additional broker, when adding the additional broker, and to automatically update a routing table in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Further another objective of the present invention is to quickly terminate an abnormal connection by terminating a connection of one side according to a predetermined standard, when a plurality of connections is set up between brokers, and to efficiently maintain a number of connections from the viewpoint of the entire network, in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Still another objective of the present invention is to suggest a new communication network structure which can deviate from a conventional network structure connecting all game servers to each other in a full mesh topology, simplify a connection structure between servers, and easily maintain the same and also can efficiently extend a service.

Technical Solutions

To achieve the above objectives and solve the aforementioned problems in the conventional art, according to an aspect of the present invention, there is provided a method for processing a message routing in a communication network system having a bus network structure, wherein: the communication network system includes a broker processing a message routing, a connector, and a plurality of services which is a communicable terminal node connected to the broker via the connector, and the method includes the steps of: connecting all brokers of the communication network system to each other in a full mesh topology, each broker maintaining a predetermined routing table; connecting the connector to the broker and setting up a connection between the service and the broker via the connector; allocating a network address to the each connected service, and maintaining the network address and a socket ID of a broker connected to the each service in the routing table; and processing a message routing between the each service by using the network address and the socket ID maintained in the routing table.

According to an aspect of the present invention, there is provided a method for processing a message routing, wherein: the network address is a unicast address, and the step of processing a message routing between the each service includes the steps of: a first broker receiving a request for transfer of a message having a destination of a unicast address, from a first service connected to the first broker; the first broker identifying a second broker having a socket ID corresponding to the destination by referring to the routing table; and the first broker directly transferring the message to a second service corresponding to the destination, when the first broker and the second broker are identical, and the first broker transferring the message to the second broker and the second broker transferring the message to the second service, when the first broker and the second broker are different.

According to another aspect of the present invention, there is provided a method for processing a message routing, further including the steps of: a first broker transmitting its updated routing information to all second brokers connected to the first broker in a full mesh topology, when the first broker's routing table has been updated; and the second broker receiving the updated routing information to update its routing table.

According to still another aspect of the present invention, there is provided a method for processing a message routing, further including the steps of: an additional broker setting up a connection with existing brokers connected in a full mesh topology in the communication network system, in the case of adding the additional broker; randomly selecting one of the existing brokers; and the additional broker requesting the selected broker for a routing table, receiving the routing table and reflecting the same in its own routing table.

According to another embodiment of the present invention, there is provided a communication network system in a bus network structure, the system including: a broker processing a message routing; a connector; and a plurality of services connected to the broker via the connector, wherein: the service is a communicable terminal node, and a network address uniquely identifying each service is allocated to the each service, the connector is a module for mediating a connection between the service and the broker, the broker is a module for setting up a routing path or a connection with the connector to process the routing message, each broker is connected to each other in a full mesh topology, and the broker maintains the network address and a socket ID of a broker connected to the each service in a predetermined routing table, and processes a message routing between the each service by using the network address and the socket ID maintained in the routing table.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram illustrating network connections between game servers according to conventional art;

FIG. 2 is a diagram illustrating network connections between game servers which may occur as a number of game servers continuously increases in the conventional art;

FIG. 3 is a schematic diagram illustrating a bus network structure according to the present invention;

FIG. 4 is a schematic diagram illustrating a connection of a communication network system in a bus network structure according to the present invention;

FIG. 5 is a diagram illustrating a connection of a broker, a connector, and a service in a communication network system according to the present invention;

FIG. 6 is a diagram illustrating an example of various types of servers connected to each other via a message routing server (MRS) network according to the present invention;

FIG. 7 is a diagram illustrating a structure of a message used in a communication network system according to the present invention;

FIG. 8 is a diagram illustrating an address system according to the present invention;

FIG. 9 is a diagram illustrating a unicast data processing method according to an embodiment of the present invention;

FIG. 10 is a diagram illustrating a multicast data processing method according to an embodiment of the present invention;

FIGS. 11 and 12 are diagrams illustrating an anycast data processing method according to an embodiment of the present invention;

FIG. 13 is a flowchart illustrating a service registration process according to an embodiment of the present invention;

FIG. 14 is a flowchart illustrating a service cancellation process according to an embodiment of the present invention;

FIG. 15 is a flowchart illustrating a message transmitting/receiving process according to an embodiment of the present invention;

FIG. 16 is a flowchart illustrating a process of adding a new broker in an MRS network, in an embodiment of the present invention;

FIG. 17 is a flowchart illustrating a normal termination process of a broker, in an embodiment of the present invention;

FIG. 18 is a flowchart illustrating a process in the case of other broker detecting abnormal termination of a broker, in an embodiment of the present invention;

FIG. 19 is a flowchart illustrating a process in the case of a connector detecting abnormal termination of a broker, in an embodiment of the present invention;

FIG. 20 is a block diagram illustrating a structure of a connector according to the present invention;

FIG. 21 is a diagram illustrating an Application Programming Interface (API) which is programming interface provided from a connector according to the present invention;

FIG. 22 is a block diagram illustrating a structure of a message queue management module which is one component of a connector according to the present invention;

FIG. 23 is a block diagram illustrating a structure of a service management module which is one component of a connector according to the present invention;

FIG. 24 is a block diagram illustrating a structure of a connection management module which is one component of a connector according to the present invention;

FIG. 25 is a block diagram illustrating a structure of a broker according to the present invention; and

FIG. 26 is a block diagram illustrating a structure of a link management module which is one component of a broker according to the present invention.

BEST MODE FOR CARRYING OUT THE INVENTION

Hereinafter, a communication network system and a data transmitting/receiving method using the same according to the present invention will be described in detail with reference to the accompanying drawings.

FIG. 3 is a schematic diagram illustrating a bus network structure according to the present invention.

As illustrated in FIG. 1, in the conventional art, all game servers are connected to each other in a mesh topology. However, in the bus network structure according to the present invention, as illustrated in FIG. 3, all servers are connected to each other in a bus structure. Accordingly, the connection structure between servers is very simplified.

FIG. 4 is a schematic diagram illustrating a connection of a communication network system in a bus network structure according to the present invention.

According to the conventional art illustrated in FIG. 1, as illustrated in FIG. 2, every time new game servers are added, there is a surprising increase in a number of connections from the viewpoint of the entire network. On the other hand, as illustrated in FIG. 4, in the bus network structure according to the present invention, each server maintains a connection with one broker. Also, in the case of extending the network, an intermediate connection is performed via brokers. Accordingly, although a server is additionally connected, a number of connections is not significantly increased from the viewpoint of the entire network. Accordingly, the communication network system adopting the bus network structure of the present invention, as illustrated in FIGS. 3 and 4, may easily link a new service and also may easily maintain and manage the linked service.

FIG. 5 is a diagram illustrating a connection of a broker, a connector, and a service in a communication network system according to the present invention.

As illustrated in FIG. 5, the communication network system according to the present invention includes a broker 501 processing a message routing, a connector 502 and a plurality of services 503 connected to the broker 501 via the connector 502.

The service 503 is a communicable terminal node. Each service 503 is connected to the broker 501 via one connector 502.

In the communication network system according to the present invention, a network address uniquely identifying each service 503 is allocated to each service 503. In this instance, the network address corresponds to a unique address value capable of identifying each service 503 in the entire communication network system according to the present invention.

The connector 502 is a module for mediating a connection between the broker 501 and the service 503. Only one broker 501 is connected to each connector 502 and the service 503 may be registered in the broker 501 via the connector 502.

According to an embodiment of the present invention, the connector 502 and the service 503 are contained in an identical process. Only one connector 502 is contained in one process and at least one service 503 is contained in one process. Namely, only one connector 502 exists for each process. Also, the connector 502 may mediate a connection between all services 503 and the broker 501. In this instance, all services 503 exist in a process containing the connector 502.

According to the present embodiment, a connector and a process are matched 1:1. Accordingly, a communication network system may be unified. Also, inefficient routing, which may occur when connecting the services 503 contained in different processes to the same broker 501 via one connector 502, may be prevented. Also, complexity in transmitting/receiving data may be prevented.

The broker 501 is a module for setting up a routing path or the connection with the connector 502 to efficiently process the message routing. The brokers 501 are connected to each other in a full mesh topology.

In the present specification, a network formed by connecting the brokers 501 in a full mesh topology is defined as a message routing server (MRS) network 500. Accordingly, the MRS network 500 is a network service platform for efficiently transmitting/receiving a message between various types of communication systems. The connector 502 is a module for providing a programming interface for transmitting/receiving a message by using the MRS network 500. The service 503 utilizes the MRS network 500 via the programming interface provided by the connector 502.

As illustrated in FIG. 5, in the communication network system according to the present invention, there is only one effective connection between the broker 501 and the connector 502. In the case of communicating with the broker 501, each service 503 sequentially communicates with the broker 501 via said only one connection.

Only one connection should be set up between brokers 501 connected to each other in a full mesh topology in the MRS network 500. If a plurality of brokers 501 simultaneously requests a connection and a plurality of connections is set up, this may cause a problem.

According to an embodiment of the present invention, when a first broker 501 and a second broker 501 request a connection to each other at the same time and a plurality of connections is set up between the first broker 501 and the second broker 501, each IP address of the first broker 501 and the second broker 501 is compared. Which one connection will be terminated among a plurality of connections may be determined on the basis of the comparison. For this, a method of determining the each IP address as a DWORD value of 4 bytes and terminating a connection requested by the broker 501 corresponding to an IP address having a smaller value may be utilized.

According to the present embodiment, it is possible to quickly terminate an abnormal connection and efficiently maintain a proper number of connections from the viewpoint of the entire network by terminating a connection of one side according to an explicit standard, when a plurality of connections is set up between brokers 501.

As described above, the broker 501 functions to set up a routing path to efficiently process a message routing. For this, all brokers 501 in the MRS network 500 maintain a routing table for the message routing.

Also, the broker 501 may set up a connection with the service 503 via the connector 502 connected to the broker 501, receive a service registration request from the service 503, and include routing information of the corresponding service 503 in its routing table.

As described later, in the present invention, a network address is allocated to the each service 503 and the allocated network address may uniquely identify the service 503 in the entire network. In this instance, a routing table may make a network address of each service 503 correspond to a socket ID (socket address) of a broker connected to the each service 503 and include the network address and the socket ID.

Also, the broker 501 in the MRS network 500 processes a message routing between the each service 503 by using a network address of the each service 503 and a socket ID (socket address) of the broker 501 connected to the each service 503 which are maintained in its routing table.

FIG. 6 is a diagram illustrating an example of various types of servers connected to each other via an MRS network according to the present invention.

As illustrated in FIG. 6, various types of game related servers such as a game string server, a channel list server, a game server, a notice server, a management server, a database server, etc., are connected to each other via an MRS network 600. Each server maintains only one connection with any one of a plurality of brokers which are connected to each other in a full mesh topology.

In the conventional art, all game related servers are connected to each other in a full mesh topology. Accordingly, the more a number of partner servers connected to one server, the more the total number of connections geometrically increases. On the other hand, according to the present invention, as illustrated in FIG. 6, each server maintains a connection with only one broker. Also, in the case of extending the network, an intermediate connection is performed via brokers. Accordingly, although a server is additionally connected, a number of connections is not significantly increased in the viewpoint of the entire network.

FIG. 7 is a diagram illustrating a format of a message used in a communication network system according to the present invention. Referring to FIG. 7, the format of transmitting/receiving a message between a connector and a broker, and between brokers, which are subsystems of the communication network system according to the present invention, will be described.

In the present specification, the structure of the message will be described based on a data type which is widely used in Windows, rather than an octet notation, as a data type for defining a field of each message. In this case, Windows data type and octet notation is mapped, such as “BYTE: octet(8)”, “WORD: octet(16)”, and “DWORD octet(32)”.

Messages used in the communication network system according to the present invention are grouped into MRMSGHeader and MRCMPHeader. Each message is divided into fields, of which one is a common field containing MRHeader, and remaining fields are specified fields of each message.

MRHeader is message header information that all messages exchanged in the communication network system, according to the present invention, should contain as a common field. An MRHeader message may not be used alone. The MRHeader message must be transmitted/received after inserting a valid value in a protocol type field and appending additional message information to the MRHeader.

TABLE 1 Type Name Description WORD Version Indicates version information of a message. Indicates a major version in an upper byte and a minor version in a lower byte. BYTE Protocol This value may contain two values, type PT_MESSAGE and PT_MRCMP. PT_MESSAGE gives notice that fields coming after MRHeader is in an MRMSGHeader format. Also, PT_MRCMP gives notice that fields coming after MRHeader is in an MRCMPHeader format. BYTE TTL This means time to live. A message transmitted/received in a communication network according to the present in- vention decrements a TTL value by one every time a broker of an MRS network processes routing, and in the case of the TTL value being 0, does not process routing and generates a transmission error. DWORD Length Means the length of MRHeader and MRMSG- Header coming thereafter, in other words, the length of the entire message containing MRCMPHeader.

A transferred message in the MRMSGHeader format has a structure for transferring a payload value designated by a service between a plurality of services connected to an MRS network.

In this case, a source address and a destination address are described in the message transmitted/received in the structure of MRMSGHeader. The source address is an address of a transmitter transmitting a message and the destination address is an address of a receiver receiving the message. Also, the MRS network tries routing on the basis of connection information and the destination address. Each field will be described in Table 2 below.

TABLE 2 Type Name Description MRHeader Not The aforementioned MRHeader structure. (8 bytes) defined MRADDRESS Source An address of a message transmitter. (16 bytes) address Also, MRADDRESS is a data type for defining a source address and destina- tion address field of the MRMSGHeader. MRADDRESS Destination An address of a message receiver. (16 bytes) address Not Not A user defined message. The length in defined defined an MRHeader format of a corresponding message has to contain the total length from MRHeader through a payload defined by a user.

A transferred message in the format of MRCMPHeader is a message defined for transmitting/receiving a signal between a connector and a broker, and between brokers. In this instance, the connector and the broker are subsystems of the communication network system according to the present invention. Each field will be described in Table 3 below.

TABLE 3 Type Name Description MRHeader Not The aforementioned MRHeader structure. (8 bytes) defined WORD Control A signal command to be transmitted/received. An code upper byte functions to divide a role of the signal and a lower byte functions as a divider in dividing the purpose. Not Not A field for adding variable length associated with defined defined a control code. This field may be transformed into various lengths according to the content of the control code.

Hereinafter, an address system used in the present invention will be described.

In the case of designating a source address and a destination address to transmit/receive data using an MRS network, the present invention utilizes a new address system according to the present invention, not an IP address. The MRS network supports three types of addresses, which are unicast, anycast, and multicast, to identify a particular service. Each address is in the form of a cast type and an address in any one of the three address types, and has the length of 16 bytes.

In the case of an online game, a plurality of service instances interacts and communications between the service instances also increase. However, in the conventional art, a network address is not allocated to the service instances. Namely, one process having an identical network address contains many service instances and processes a large number of communications between service instances.

Accordingly, the present invention utilizes a new address system, allocates a single network address to each service instance and efficiently processes a communication between service instances. In this case, a game server does not need to distribute messages to each of a plurality of game centers. Accordingly, management cost may be significantly reduced.

For this, the present invention allocates a network address uniquely identifying each service to the same. Also, the network address is defined as a unique address value capable of identifying the each service in the entire network system according to the present invention.

In the present invention, data is transmitted/received between services registered in an MRS network via a connector and a broker, on the basis of the network address.

Also, the present invention supports three types of addresses which are unicast, anycast and multicast.

A communication network system according to the present invention may register a service in a broker via a connector, by using a unicast address which is a network address allocated to each service. Also, the communication network system may make at least one portion of the registered services join an anycast group or a multicast group according to a function of a corresponding service and transmit/receive data between the registered service and the service registered in the anycast group or the multicast group. Namely, in the present invention, data may be transmitted or received from a unicast address of a source transmitting a message to an anycast address of a destination receiving the message.

For this, a connector of the communication network system according to the present invention may function to register services in a broker and to make at least one portion of the registered services join an anycast group or a multicast group according to a function of a corresponding service. A broker in an MRS network may function to route a message received from a particular service and transmit/receive data between the service and a registered service in the anycast group or the multicast group. Also, the broker is registered with a unicast address of each service and also with the anycast address or the multicast address of the service registered in the anycast address or the multicast address.

As an example, when a service A providing a GOSTOP game service is generated, a connector may initially register a unicast address of the service A in a broker, and subsequently make the service A join a multicast group associated with providing of the GOSTOP game service. When a service B transmits a packet asking how many users are using a game with respect to GOSTOP game services, a broker may receives the packet and transmit the same to the service A and a multicast address of all the services registered in the multicast group. The service A receives a response to the query via the broker.

As described above, in the present invention, each service may be grouped into an anycast or multicast group according to its properties. The grouping may be performed by using a unicast address which is a unique network address allocated to each service. Accordingly, the grouped service may be a service operating in a physically separated server.

FIG. 8 is a diagram illustrating an address system according to the present invention.

In FIG. 8, a cast type is the type of an address and has one value from among CT-UNICAST, CT_MULTICAST and CT_ANYCAST.

A unicast address is a network address which is allocated to each service and also a unique address capable of identifying all the services using an MRS network. Also, the unicast address is in the form of a server name and an instance ID. In this instance, the server name identifies a server activating a particular service in the entire network of the communication network system according to the present invention. The instance ID uniquely identifies a corresponding service in the same server.

A server name is a unique value of 11 bytes indicating a computer hardware server in which a service using the MRS network is activated. A server name may be a unique value of 11 bytes identifying a server, in which a service is activated, within the entire network.

The instance ID is a unique identifier identifying a service in the same server. A reserved value is allocated to the instance ID with respect to a portion of services and a dynamically generated value in the server is allocated to the instance ID with respect to the rest of the services.

As an example, values of 1 to 65535 are reserved for when a service requires a fixed unicast address. Values after 65536 may be dynamically allocated and used within the server. In this instance, the service requiring a fixed unicast address may include a service that continuously operates from starting to termination of the communication network system according to the present invention thereof.

The unicast address described above may be arranged as Table 4 below.

TABLE 4 Type Name Description BYTE Cast type In the case of a unicast address, always CT_UNICAST. DWORD Instance In the case of requiring a plurality ID of addresses in a corresponding com- puter, each address may be separated by using an instance No. 0x0000 to 0xffff as reserved numbers for the instance ID. BYTE Server An identifier capable of identifying (x11) name a corresponding computer. Generally, a NetBIOS name of a local computer may be used as a server name. Accordingly, all computers using an MRS network should have acomputer name which can be distinguished from other computers, and of which the length should be within 11 bytes.

The multicast address and anycast addresses simply utilize a 15 byte length value. Accordingly, the multicast and anycast addresses may be readily set up and utilized between services. This value should be a unique value in the entire network and also known in advance.

The multicast/anycast address may be arranged as Table 5 below.

TABLE 5 Type Name Description BYTE Cast In the case of a multicast address, defined as type CT_MULTICAST. Also, in the case of an anycast address, defined as CT_ANYCAST. BYTE Service An identifier capable of identifying a corre- (x15) Name sponding service. Multicast and anycast addres- ses do not designate a computer or a service, but are a virtual address system. Also, the service name is a unique value that can be identified in the entire MRS network.

Examples of using an MRS network according to the present invention may include (1) the case of a service accessing the MRS network to utilize a function of other services and (2) the case of a service accessing the MRS network to provide a function of processing a matter requested from other services.

As an example of (1) the case of a service accessing the MRS network to use a function of other services, there may be a service sending a request to a login server to confirm user login information and receiving a response thereto. The service for utilizing a function provided by other services operates as shown below, via a connector which is a module for mediating the MRS network and the service.

Initially, when starting a process, a programming interface is initialized to transmit/receive data between the service and a connector. After registering a unicast address which is a network address of the service in the MRS network, the service sends a request message to other services and receives a response message therefrom. Also, in the case of completing the use of the function provided by other services, the unicast address of the service is removed from the MRS network. When ending the process, the programming interface is also terminated.

As an example of (2) the case of a service accessing the MRS network to provide a function of processing a matter requested from other services, there may be a service providing a database reference function and a service providing a user's login information or location information. The service for providing a particular function to other services operates as shown below, via a connector which is a module for mediating the MRS network and the service.

Initially, when starting a process, a programming interface is initialized to transmit/receive data between the service and a connector. After registering a unicast address of the service in the MRS network, the service joins an anycast or multicast group with respect to a function to be provided. Also, the service receives a request message from other services and sends a response message thereto. Also, in the case of completing providing of the particular function to another service, the service leaves the joined anycast or multicast group. The unicast address of the service is removed from the MRS network. When ending the process, the programming interface is also terminated.

As described above, in the present invention, a connector may register a unicast address of a service in an MRS network, and make the service join an anycast or multicast group according to a function of the service and leave the service from the joined anycast or multicast group, in the case of termination of the service.

Hereinafter, a message routing method supported in an MRS network according to the present invention will be described.

Initially, a routing method of a message including unicast data will be described.

FIG. 9 is a diagram illustrating a unicast data processing method according to an embodiment of the present invention.

All brokers of an MRS network according to the present invention maintain their routing table to process a message routing. A unicast address allocated to each service and a socket ID (socket address) of a broker connected to each service correspond to each other and are maintained in the routing table. The broker processes a message routing between each service by using the unicast address of the service and the socket ID of the broker maintained in the routing table.

Referring to FIGS. 9 to 12, in a routing table maintained by each broker, each unicast address of services S1 and S2 may be maintained in correspondence to cs4.platform.nhncorp.com or 221.148.17.54 which is a socket ID of broker CS4. Also, each unicast address of services S3 and S4 may be maintained in correspondence to cs8.platform.nhncorp.com or 221.148.17.51 which is a socket ID of broker CS8. Also, each unicast address of services S5 and S6 may be maintained in correspondence to cs6.platform.nhncorp.com or 221.148.17.55 which is a socket ID of broker CS6.

As an example, in FIG. 9, when the broker CS4 receives a request for transfer of a message having a destination as a unicast address from the service S1 connected to the broker CS4, the broker CS4 identifies a broker having a socket ID corresponding to the destination by referring to its routing table.

When the destination is the service S2, the broker CS4 directly transfers the message to the service S2 corresponding to the destination, by not using another broker. This is because the service S2 is maintained in the routing table, in correspondence to the socket ID of the broker CS4.

Also, when the destination is the service S3, the broker CS4 transfers the message to the broker CS8 and the broker CS8 transfers the message to the service S3 corresponding to the destination. This is because the service S3 is maintained in the routing table, in correspondence to the socket ID of the CS8.

FIG. 10 is a diagram illustrating a multicast data processing method according to an embodiment of the present invention.

In FIGS. 10 and 12, it is assumed that S1 is a service not registered in an anycast or multicast group, S2, S4 and S6 are services registered in the anycast group, and S3 and S5 are services registered in the multicast group.

A broker in an MRS network according to the present invention maintains a unicast address of each service and a socket ID of a broker connected to each service in its routing table. Also, the broker may further include a multicast address of a service registered in a multicast group, in its routing table. In this case, the routing table maintains the multicast address in correspondence to a socket ID of a broker connected to each service.

As an example, in FIG. 10, when the broker CS4 receives a request for transfer of a message having a destination for a multicast address, from the service S1 connected to the broker CS4, the broker CS4 identifies at least one broker having a socket ID corresponding to the destination by referring to its routing table.

In this case, brokers CS6 and CS8 having a socket ID corresponding to services S3 and S5 registered in the multicast group are identified by using the routing table. The broker CS4 transfers the message to the brokers CS6 and CS8. Accordingly, the broker CS6 transfers the message to the service S5 connected to the broker CS6 and the broker CS8 transfers the message to the service S3 connected to the broker CS8.

When service S7 (not illustrated) registered in the multicast group is connected to the broker CS4, the broker CS4 may identify a socket ID corresponding to the service S7 as its socket ID by referring to its routing table and transfer the message to service S7 without going via other brokers.

FIGS. 11 and 12 are diagrams illustrating an anycast data processing method according to an embodiment of the present invention.

A broker in an MRS network according to the present invention maintains a unicast address of each service and a socket ID of a broker connected to each service in its routing table. Also, the broker may further include an anycast address of a service registered in an anycast group, in its routing table. In this case, the routing table maintains the anycast address in correspondence to a socket ID of a broker connected to each service.

As an example, when the broker CS4 receives a request for transfer of a message having a destination as an anycast address, from the service S1 connected to the broker CS4, the broker CS4 identifies at least one broker having a socket ID corresponding to the destination by referring to its routing table and selects one of the at least one broker.

In this case, brokers CS4, CS8 and CS6 having a socket ID corresponding to services S2, S4 and S6 registered in the anycast group are identified by using the routing table. The broker CS4 selects one of the identified brokers CS4, CS8 and CS6.

FIG. 11 illustrates the broker CS4 selecting the broker CS4 itself from the identified brokers. As illustrated in FIG. 1, in this case, the broker CS4 transfers the message to the service S2 without going via other brokers.

FIG. 12 illustrates the broker CS4 selecting the broker CS6 or CS8 from the identified brokers. When selecting the broker CS8, the broker CS4 transfers the message to the broker CS8 and the broker CS8 transfers the message to the service S4. Also, when selecting the broker CS6, the broker CS4 transfers the message to the broker CS6 and the broker CS6 transfers the message to the service S6. When a plurality of anycast addresses is connected to one broker, a broker transferring a message may randomly select one of the plurality of anycast addresses and transfer the message to the selected anycast address.

According to an embodiment of the present invention, when a broker in an MRS network receives anycast data having a destination as an anycast address, from a unicast address of a service corresponding to a source, the broker may select a service having a minimum routing distance for transmission of the anycast data and transmit the anycast data to the selected service.

In the present embodiment, a broker in an MRS network having received anycast data may operate to transmit the anycast data to a service, when the service is directly connected to the broker among services registered in an anycast group. Also, when a directly connected service does not exist, the broker may randomly select a service to transmit anycast data via other brokers connected to the broker in a full mesh topology.

Namely, a broker in an MRS network having received anycast data may select a service to transmit the anycast data, when the services registered via a connector directly connected to the broker exist. However, when the registered service does not exist, the broker may randomly select one of a plurality of services registered in the anycast group and transmit anycast data to the selected service.

According to the present embodiment, a routing distance is remarkably shortened by processing anycast data as described above. Accordingly, routing may be performed quickly. Also, natural load balancing may be embodied while not using an L4 switch.

Hereinafter, an operation process of a service, a connector and a broker which are subsystems of a communication network system according to the present invention will be described with reference to FIGS. 13 to 19.

FIG. 13 is a flowchart illustrating a service registration process according to an embodiment of the present invention. A system that wants to provide or use a particular service in a communication network system according to the present invention has to register in the system itself in an MRS network via its connector.

In step S1301, a service transmits a service registration message to a connector. In step S1302, the connector analyzes the service registration message to check whether the same is a pre-registered service. In step S1303, in the case of the service not pre-registered, the connector transfers the service registration message to a broker.

In step 1304, the broker adds routing information of the service having transmitted the service registration message, to its routing table. Also, in step 1305, the broker transmits the routing information to other brokers. In step 1306, other brokers update their routing information by using the received routing information.

As described above, in the present invention, a broker, in the case of updating its routing table, transmits the updated routing information to other brokers in an MRS network connected to each other in a full mesh topology. The brokers having received the updated routing information update their routing table. As a result, all the brokers in the MRS network may maintain latest routing information at all times.

FIG. 14 is a flowchart illustrating a service cancellation process according to an embodiment of the present invention. A system that has registered in the system itself in an MRS network performs a service cancellation process via a connector, to remove the system itself from the MRS network. After performing the service cancellation process, all service requests via the MRS network are blocked.

In step 1401, a service transmits a service cancellation message to a connector. In step 1402, the connector analyzes the service cancellation message to check whether the same is a final cancellation. In step 1403, in the case of the final cancellation, the connector transfers the service cancellation message to a broker.

In step S1404, the broker deletes routing information of the service having transmitted the service cancellation message, from its routing table and updates its routing table. In step S1405, the broker notifies other brokers of deletion of the routing information. In step S1406, other brokers receive the notice, detect deletion of the routing information, and update their own routing table.

FIG. 15 is a flowchart illustrating a message transmitting/receiving process according to an embodiment of the present invention. Namely, FIG. 15 illustrates a process of transmitting a message to a service to utilize the service, or receiving a message which requests a service.

In step S1501, a service that wants to utilize a particular service transfers a connection message to a connector, and sets up a virtual connection with the connector. In this case, an address of a desired service is designated.

In step S1502, the service transmits a message by using a programming interface of the connector. In step S1503, the connector adds a Message Routing Protocol (MRP) Header according to MRP to the message transmitted from the service and transmits a corresponding message to a broker connected to the connector. In this instance, MRP is used in the MRS network. In step S1504, the broker searches for a destination of the message received from the connector. In step S1505, the broker transmits the message to a corresponding broker or a corresponding connector.

In step S1506, the broker receives a message from another broker. In step S1507, the broker searches for a destination of the received message. In step S1508, the broker transmits the message to a corresponding connector. In step S1509, the connector removes the MRP Header from the transmitted message and searches for a destination address and instance of the transmitted message. In step S1510, the message is transmitted to a corresponding service and the corresponding service receives the message.

In a communication network system according to the present invention, messages transferred to a broker via a connector through the aforementioned process are transparently transmitted/received to other brokers or connectors. Also, in the communication network system, a message transferred by a particular service may be transparently transmitted/received via a routing path, between brokers provided in the routing path.

FIG. 16 is a flowchart illustrating a process of adding a new broker in an MRS network, in an embodiment of the present invention.

In step S1601, an additional broker to be newly added is waiting for existing brokers to be connected first. In step S1602, the additional broker sets up a connection with the existing brokers that are being implemented. In step S1603, the existing brokers connected to the additional broker add the same to their broker list recording other brokers connected to the existing brokers, and update the broker list. In the same manner, in step S1604, the additional broker sets up a connection with other existing brokers that are being implemented. In step S1605, broker lists of the other existing brokers are also updated. As described above, broker lists of all brokers that are being implemented in the MRS network may be updated.

In step S1606, the additional broker is connected to all the existing brokers that are being implemented, and randomly selects any one of the existing brokers. In step S1607, the additional broker requests the selected broker for a routing table thereof and, in step S1608, receives the same. In step S1609, the additional broker reflects the received routing table in its routing table. In step S1610, the additional broker notifies other existing brokers that the additional broker itself is ready for a connection with a connector.

In step S1611, existing brokers receive the notice and count a number of re-setup connectors to be moved to the additional broker among connectors connected to the existing brokers and select the same number of connectors as the counted number. In this instance, when a number of connectors connected to the existing broker exceeds an average number of connections obtained by dividing a number of connections between all connectors and brokers existing in the entire network by the total number of brokers, existing brokers may select an excess number of connectors as re-setup connectors.

Also, in step S1612, each of the existing brokers having received the notice notifies all connectors connected to the broker itself that the additional broker has been connected. In step S1613, each of the connectors having received the notice adds the additional broker to its broker list recording brokers connected to the connector itself.

In step S1614, a message informing to re-setup a connection with the additional broker is transferred to the selected re-setup connectors. In step S1615, the connectors having received the message are connected to the additional broker and transfer a service registration message with respect to services connected to the connectors, to the additional broker.

Also, as connections between the additional broker and the selected re-setup connectors are completed, routing tables of the additional broker and the existing brokers are all updated.

The steps of S1610 to S1615 may be performed with respect to all brokers that are being implemented in the MRS network. Also, through the aforementioned process, a certain portion of connectors connected to brokers that are being implemented and services connected to the connectors may be moved to an additional broker in the MRS network. Accordingly, load may be efficiently distributed between brokers.

FIG. 17 is a flowchart illustrating a normal termination process of a broker, in an embodiment of the present invention.

In step S1701, a broker to be normally terminated sets itself so that a connector may no longer connect to the broker. In step S1702, the broker to be normally terminated notifies other brokers that the broker will be terminated. In step S1703, the terminating broker and other brokers having received the notice notifies the same to connectors connected to the other brokers.

In step S1704, the terminating broker transmits a message to connectors connected to the terminating broker. In this instance, the message is about re-setup of connectors, informing the connectors to move to other broker. In step S1705, connectors having received the message are connected to another broker and transmit a service registration message with respect to services connected to the connectors.

In step S1706, the newly connected broker of connectors from the terminating broker soon updates its routing information and transmits the updated routing information to the terminating broker and other brokers.

In step S1707, the terminating broker updates its routing table by using the transmitted routing information and checks whether the terminating broker's connection with the connector is still included in the routing table of the broker. If not, the connection is terminated in step S1708.

In step S1709, the terminating broker checks whether a predetermined time has passed from a point in time when a message about re-setup of connectors, informing the connectors to move to other broker, is transmitted to the connectors connected to the terminating broker. In step S1710, in the case of having connectors connected to the terminating broker even after the certain time, the terminating broker terminates all connections with the connectors and terminates the broker itself.

FIG. 18 is a flowchart illustrating a process in the case of another broker detecting abnormal termination of a broker, in an embodiment of the present invention.

In step S1801, a broker is abnormally terminated. In this case, in step S1802, another broker detects abnormal termination of the broker. In step S1803, another broker readjusts its maximum capacity.

A maximum number of connectors connectable to one broker, as an example, 50, is the broker's maximum capacity. In the case of another broker detecting abnormal termination of a broker, the another broker may increase its maximum number of connectors connectable to one broker to 60, and operate to enable connectors connected to the abnormally terminated broker to quickly move to other brokers and be connected thereto. In this case, a service disconnection time may be significantly reduced.

In step S1804, another broker having detected abnormal termination of the broker updates its routing information and notifies other brokers to update their routing table. In step S1805, other brokers are notified of the abnormal termination of the broker and cause their connectors to update their broker list.

FIG. 19 is a flowchart illustrating a process in the case of a connector detecting abnormal termination of a broker, in an embodiment of the present invention.

In step S1901, a broker is abnormally terminated. In this case, in step S1902, a connector connected to the broker detects that the broker connected to the connector is abnormally terminated. In step S1903, the connector deletes the abnormally terminated broker from its broker list.

In step S1904, the connector having deleted the abnormally terminated broker from its broker list randomly selects any one of other brokers from its broker list. In step S1905, the connector is connected to the selected broker. In step S1906, the connector registers all services connected to the connector itself to the selected broker.

In step S1907, the broker with the newly added services transmits its updated routing information to other brokers and notifies the same that the services are registered.

Hereinafter, a structure of a connector which is a subsystem of a communication network system according to the present invention and a function of each component will be described.

FIG. 20 is a block diagram illustrating a structure of a connector according to the present invention.

As illustrated in FIG. 20, a connector 2000 includes an API 2001, a message queue management module 2002, a service pool management module 2003, a service management module 2004 and a connection management module 2005.

The API 2001 is an Application Programming Interface which exposes a function of the connector 2000 to a service connected to the connector 2000. A system that wants to utilize an MRS network according to the present invention uses the API 2001 and transmits/receives data.

FIG. 21 is a diagram for explaining the API 2001 and a relationship with respect to a process of a service and a connector.

As illustrated in FIG. 21, according to an embodiment of the present invention, a connector and a service are contained in an identical process. Only one connector may be contained in one process and at least one service may be contained in one process. Namely, one connector is contained in each process and the connector may mediate a connection between all services connected to the connector and the broker constructing an MRS network.

According to the present embodiment, a communication network system may be unified by matching a connector and a process 1:1. Also, inefficient routing may be prevented. In this instance, the inefficient routing occurs when connecting services contained in different processes to the same broker via one connector. Also, complexity in transmitting/receiving data may be prevented.

As illustrated in FIG. 21, at least one service contained in one process may be connected to an MRS network via one connector 2000. In this case, a connection and data transmitting/receiving between services and the connector 2000 may be performed via the API 2001.

Namely, to transmit/receive data by using the MRS network, the service may not directly set up a connection with the MRS network to transmit/receive data. The service transmits/receives data by using the API 2001 provided from the connector 2000. As a result, the API 2001 receives a request for registration or cancellation of a service, and a request for transmission of data to the broker 2010, from the service.

The connector 2000 is a module for providing the API 2001. Also, the connector 2000 is loaded in each process using the MRS network and functions to transmit/receive a message to the MRS network, with respect to all services generated in a corresponding process.

The message queue management module 2002 functions to manage an MRP packet used in the MRS network according to the present invention. In this instance, the MRP packet is a unit of data transmitted/received between the connector 2000 and the broker 2010.

FIG. 22 is a block diagram illustrating a structure of the message queue management module 2002.

As illustrated in FIG. 22, the message queue management module 2002 may include a transmission queue 2201 and a receiving queue 2202.

In this instance, the transmission queue 2201 functions to manage an MRP packet to be transmitted to the broker 2010, and the receiving queue 2202 functions to manage an MRP packet received from the broker 2010.

The service pool management module 2003 functions to register a service in the broker 2010 or remove the service from the broker, and to manage the registered service. The service management module 2004 functions to manage information on the registered service.

FIG. 23 is a block diagram illustrating a structure of the service management module 2004.

As illustrated in FIG. 23, the service management module 2004 may include a receiving message queue 2301, a receiving buffer queue 2302 and a completion queue 2303.

In this instance, the receiving message queue 2301 functions to manage a received message from the broker 2010. The receiving buffer queue 2302 functions to manage a receiving buffer registered by the service. The completion queue 2303 functions to manage completed results with respect to input/output requested from the service.

The connection management module 2005 functions to transmit/receive an MRP packet and manage a socket connection with the broker 2010.

FIG. 24 is a block diagram illustrating a structure of the connection management module 2005.

As illustrated in FIG. 24, the connection management module 2005 may include a message transmission module 2401 and a connection control module 2402.

In this instance, the message transmission module 2401 functions to load an MRP packet to be transmitted from the message queue management module 2002 and transmit the same to the broker 2010 and to transfer an MRP packet received from the broker 2010 to the message queue management module 2002. Also, the connection control module 2402 functions to process a control message between the connector 2000 and the broker 2010 and control a connection therebetween.

Hereinafter, a structure of a broker, which is another subsystem of a communication network system according to the present invention, and a function of each component will be described.

FIG. 25 is a block diagram illustrating a structure of a broker.

As illustrated in FIG. 25, a broker 2500 may include a link management module 2501, a routing information management module 2502, a message division module 2503, a message router 2504, a message deserializer 2505, a message transactor 2506, a message serializer 2507 and an automatic configurator 2508.

The link management module 2501 functions to maintain and manage a connection with a connector or other broker, and also to transmit/receive data with the connector or other broker.

The routing information management module 2502 functions to maintain and manage routing information of a service registered in the broker 2500. Also, the routing information management module 2502 may maintain a connection pool including connection information with a connector connected to the broker 2500 or other brokers.

The message division module 2503 functions to understand a type of data received in the link management module 2501 and divide the received data into a simple message and a complex message according to a predetermined standard.

The message router 2504 functions to receive the simple message from the message division module 2503, obtain location information of a destination associated with the simple message, from the routing information management module 2502, and transfer the obtained location information to the link management module 2501.

The message deserializer 2505 functions to receive the complex message from the message division module 2501 and convert the received complex message into an object.

The message transactor 2506 functions to receive the object from the message deserializer 2505 and control the broker 2500 by using the object.

The message serializer 2507 functions to receive the object from the message transactor 2506, process the object into transmittable linear data, and transfer the same to the link management module 2501.

The automatic configurator 2508 functions to track a status of a network containing the broker 2500 and automatically adjust the status of the broker 2500.

FIG. 26 is a block diagram illustrating a structure of the link management module 2501.

As illustrated in FIG. 26, the link management module 2501 may include an OS socket subsystem 2601, a link accepter 2602, a data receiving module 2603, a data transmission module 2604 and a link agent 2605.

The OS socket subsystem 2601 functions as interface for transmitting/receiving data with a connector connected to the broker 2500 or other broker.

The link accepter 2602 functions to receive a connection request from the connector connected to the broker 2500 or other broker via the OS socket subsystem 2601 and record connection information according to the connection request in the connection pool maintained by the routing information management module 2502.

The data receiving module 2603 functions to receive data from the connector connected to the broker 2500 or other brokers and transfer the data to the message division module 2503.

The data transmission module 2604 functions to receive processed data from the message serializer 2507 and transmit the processed data to the connector connected to the broker 2500 or other brokers.

The link agent 2605 functions to attempt a connection with the connector connected to the broker 2500 or another broker via the OS socket subsystem 2601 according to a request from the data transmission module 2604, and in the case of a successful connection, update the connection pool maintained by the routing information management module 2502 by using connection information.

Also, the data transmission module 2604 may check whether a connection with another broker or a connector associated with a destination of data to be transmitted is set up by referring to the connection pool. In the case the connection not set up, the data transmission module 2604 may operate to attempt data transmission after requesting the link agent 2605 to set up a connection with a connector connected to the broker or another broker.

The method for transmitting/receiving data in a communication network according to the present invention includes computer readable media including program instructions to implement various operations embodied by a computer. The media may also include, alone or in combination with the program instructions, data files, data structures, tables, and the like. The media and program instructions may be those specially designed and constructed for the purposes of the present invention, or they may be of the kind well known and available to those having skill in the computer software arts. Examples of computer-readable media include magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD ROM disks; magneto-optical media such as floptical disks; and hardware devices that are specially configured to store and perform program instructions, such as read-only memory devices (ROM) and random access memory (RAM). The media may also be a transmission medium such as optical or metallic lines, wave guides, etc. including a carrier wave transmitting signals specifying the program instructions, data structures, etc. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter. The described hardware devices may be configured to act as one or more software modules in order to perform the operations of the present invention.

Although a few embodiments of the present invention have been shown and described, the present invention is not limited to the described embodiments. Instead, it would be appreciated by those skilled in the art that changes may be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.

INDUSTRIAL APPLICABILITY

According to the present invention, there is provided a method for efficiently processing a message routing via a routing table maintained by a broker, in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Also, according to the present invention, it is possible to include a network address of each service in a routing table maintained by each broker, in correspondence to a socket ID of a broker connected to the each service, and enable a broker to efficiently perform a message routing via a routing table in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Also, according to the present invention, it is possible to automatically inform other brokers when a routing table maintained by a particular broker is changed, and to enable the other brokers to update their routing table in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Also, according to the present invention, it is possible to embody natural load balancing by moving a proper number of connectors connected to an existing broker to an additional broker, when adding an additional broker, and to automatically update a routing table in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Also, according to the present invention, it is possible to quickly terminate an abnormal connection by terminating a connection of one side according to a predetermined standard, when a plurality of connections is set up between brokers, and to efficiently maintain a number of connections from the viewpoint of the entire network, in a new communication network system having a simplified connection structure between servers by using a bus network structure.

Also, according to the present invention, it is possible to suggest a new communication network structure which can deviate from a conventional network structure connecting all game servers to each other in a full mesh topology, simplify a connection structure between servers, and easily maintain the same and also can efficiently extend a service. 

1. A method for processing a message routing in a communication network system having a bus network structure, the method comprising steps of: establishing a communication network by connecting a plurality of brokers to each other in a mesh topology wherein each of the brokers is configured for routing a message between any pair of a plurality of service terminal nodes in the communication network and each of the brokers includes a routing table; connecting each of the service terminal nodes to one of the brokers via a connector wherein the connector mediates a connection between the brokers and the service terminal nodes; allocating a network address to each of the connected service terminal nodes; maintaining at least some of the allocated network addresses of the connected service terminal nodes and socket addresses of the connected brokers in the routing table; and routing a message between the service terminal nodes by using information contained in the routing table.
 2. The method of claim 1, wherein the network address identifies one service terminal node in the entire communication network system.
 3. The method of claim 2, wherein: the step of processing a message routing between the service terminal nodes comprises the steps of: receiving a request for transferring a message to a second service terminal node having a unicast address as a destination, from a first service terminal node connected to a first broker; identifying a second broker having the socket address corresponding to the destination by using the routing table in the first broker; and transferring the message from the first service terminal node to the second service terminal node via the identified second broker.
 4. The method of claim 1, further comprising the steps of: making at least one portion of each of the service terminal nodes join an anycast group or a multicast group according to a function of a corresponding service; allocating an anycast address or a multicast address according to the joined group; and maintaining the anycast address or the multicast address corresponding to the socket addresses in the routing table.
 5. The method of claim 1, wherein: the step of processing a message routing between the service terminal nodes comprises the steps of: receiving a request for transferring a message to a second service terminal node having an anycast address as a destination, from a first service terminal node connected to a first broker; identifying brokers connected to service terminal nodes having an anycast address corresponding to the destination based upon the routing table in the first broker; selecting a second broker among the identified brokers; selecting the second service terminal node among service terminal nodes connected to the second broker according to a predetermined delivery scheme; and transferring the message to the selected second service terminal node.
 6. The method of claim 1, wherein: the step of processing a message routing between the service terminal nodes comprises the steps of: receiving a request for transferring a message to at least one second service terminal node having a multicast address as a destination, from a first service terminal node connected to a first broker; identifying second brokers connected to service terminal nodes having a multicast address corresponding to the destination based upon the routing table in the first broker; and transferring the message to second service terminal nodes connected to the identified second brokers according to a predetermined multicast delivery scheme.
 7. The method of claim 1, further comprising the steps of: transmitting updated routing information from a first broker to second brokers connected to the first broker in a full mesh topology, when the routing table in the first broker has been updated; and updating routing tables in the second brokers with the updated routing information from the first broker.
 8. The method of claim 1, further comprising the steps of: setting up a connection between an additional broker and existing brokers wherein the additional broker and the existing brokers are connected to each other in a full mesh topology in the communication network system; randomly selecting one of the existing brokers; and updating a routing table in the additional broker by importing a routing table from the selected broker.
 9. The method of claim 8, further comprising the steps of: notifying other brokers that the additional broker is ready for a connection with a connector; counting a number of re-setup connectors to be moved to the additional broker among connectors connected to each of the existing brokers and selecting as many re-setup connectors as the counted number; and notifying the selected re-setup connectors of setting up a connection with the additional broker and the selected re-setup connectors setting up a connection with the additional broker.
 10. The method of claim 9, wherein routing tables of the additional broker and the existing brokers are updated after setting up a connection between the additional broker and the selected re-setup connectors is completed.
 11. The method of claim 1, further comprising the steps of: comparing IP addresses of a first broker and a second broker, when the first broker and the second broker simultaneously request a connection therebetween and a plurality of connections between the first broker and the second broker is set up; and terminating one of the plurality of connections on the basis of the comparison.
 12. The method of claim 11, wherein the step of terminating one of the plurality of connections on the basis of the comparison comprises the steps of determining the IP address as a DWORD value; and terminating a connection requested by the broker corresponding to an IP address having a smaller DWORD value.
 13. The method of claim 1, wherein: only one broker is connected to each connector, each service terminal node is connected to the broker via one connector, and the connector and the service terminal node are contained in an identical process.
 14. The method of claim 13, wherein only one connector is contained in one process and at least one service terminal node is contained in one process.
 15. A computer readable record medium recording a program for implementing the method recited in claim
 1. 16. A communication network system in a bus network structure, the system comprising: a plurality of service terminal nodes; at least one connector connected to at least one of the plurality service terminal nodes; and plurality of brokers each of the brokers having a routing table wherein each of the brokers is configured for routing a message between any pair of the plurality service terminal nodes using the routing table; wherein: a network address identifying a service terminal node is allocated to each of the service terminal nodes the connector is configured for mediating a connection between the service terminal nodes and the brokers, each of the brokers is connected to each other in a full mesh topology, and the routing table includes network addresses of the service terminal nodes and socket addresses of the brokers connected to the service terminal nodes.
 17. The system of claim 16, comprising a plurality of connectors, wherein each of the plurality service terminal nodes is connected to the broker via one of the plurality connectors.
 18. The method of claim 3, wherein the message is transferred to the second service terminal node directly from the first broker when the second service terminal node is directly connected to the first broker.
 19. The method of claim 5, wherein when the first broker is the second broker, the message is transferred to the second service terminal node, directly from the first broker.
 20. The method of claim 5, wherein when the first broker is not the second broker, the second service terminal node is selected by the second broker. 